Lower Bounds on Information Dissemination in Dynamic Networks

We study lower bounds on information dissemination in adversarial dynamic networks. Initially, k pieces of information (henceforth called tokens) are distributed among n nodes. The tokens need to be broadcast to all nodes through a synchronous network in which the topology can change arbitrarily from round to round provided that some connectivity requirements are satisfied. If the network is guaranteed to be connected in every round and each node can broadcast a single token per round to its neighbors, there is a simple token dissemination algorithm that manages to deliver all k tokens to all the nodes in O(nk) rounds. Interestingly, in a recent paper, Dutta et al. proved an almost matching Ω(n + nk/ logn) lower bound for deterministic token-forwarding algorithms that are not allowed to combine, split, or change tokens in any way. In the present paper, we extend this bound in different ways. If nodes are allowed to forward b ≤ k tokens instead of only one token in every round, a straight-forward extension of the O(nk) algorithm disseminates all k tokens in time O(nk/b). We show that for any randomized token-forwarding algorithm,Ω(n+nk/(b logn log logn)) rounds are necessary. If nodes can only send a single token per round, but we are guaranteed that the network graph is cvertex connected in every round, we show a lower bound ofΩ(nk/(c log n)), which almost matches the currently best O(nk/c) upper bound. Further, if the network is T -interval connected, a notion that captures connection stability over time, we prove that Ω(n + nk/(T 2 logn)) rounds are needed. The best known upper bound in this case manages to solve the problem in O(n+ nk/T ) rounds. Finally, we show that even if each node only needs to obtain a δ-fraction of all the tokens for some δ ∈ [0, 1], Ω(nkδ/ logn) are still required.